Additive Schur Complement Approximation and Application to Multilevel Preconditioning
نویسندگان
چکیده
منابع مشابه
Additive Schur Complement Approximation and Application to Multilevel Preconditioning
In the present paper we introduce an algorithm for Additive Schur Complement Approximation (ASCA). This approximation technique can be applied in various iterative methods for solving systems of linear algebraic equations arising from finite element (FE) discretization of Partial Differential Equations (PDE). Here we will show how the ASCA can be used to construct a nonlinear Algebraic Multi-Le...
متن کاملOn Preconditioning Schur Complement and Schur Complement Preconditioning
We study two implementation strategies to utilize Schur complement technique in multilevel recursive incomplete LU preconditioning techniques (RILUM) for solving general sparse matrices. The first strategy constructs a RILUM to precondition the original matrix. The second strategy solves the first Schur complement matrix using the lower level parts of the RILUM as the preconditioner. We discuss...
متن کاملAuxiliary space multigrid method based on additive Schur complement approximation
In this paper the idea of auxiliary space multigrid (ASMG) methods is introduced. The construction is based on a two-level block factorization of local (finite element stiffness) matrices associated with a partitioning of the domain into overlapping or non-overlapping subdomains. The two-level method utilizes a coarse-grid operator obtained from additive Schur complement approximation (ASCA). I...
متن کاملAdditive Schwarz for the Schur Complement Method Additive Schwarz for the Schur Complement Method
Submitted to the proceedings of the ninth international conference on domain decomposition methods (Bergen-Norway-1996).
متن کاملApproximate Schur Complement Preconditioning of the Lowest-Order Nodal Discretizations
Certain classes of nodal methods and mixed-hybrid nite element methods lead to equivalent , robust and accurate discretizations of 2 nd order elliptic PDEs. However, widespread popularity of these discretizations has been hindered by the awkward linear systems which result. The present work overcomes this awkwardness and develops preconditioners which yield solution algorithms for these discret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2012
ISSN: 1064-8275,1095-7197
DOI: 10.1137/110845082